#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1e5 + 5;

int n;
int r[N];
bool a[N];
int i , j;
int ans;

int main()
{
    ios::sync_with_stdio(false) , cin.tie(nullptr) , cout.tie(nullptr);
    freopen("duel.in" , "r" , stdin);
    freopen("duel.out" , "w" , stdout);
    cin >> n;
    ans = n;
    for (int i = 1 ; i <= n ; i ++)
    {
        cin >> r[i];
    }
    sort(r + 1 , r + n + 1);
    // for (int i = 1 ; i <= n ; i ++)
    // {
    //     cout << r[i] << '\n';
    // }
    if (r[i] == r[n])
    {
        cout << n;
        return 0;
    }
    for (int i = n ; i >= 1 ; i --)
    {
        for (int j = i - 1 ; j >= 1 ; j --)
        {
            if (r[j] < r[i] && r[j] != -1)
            {
                ans --;
                a[i] = true;
                r[j] = -1;
                break;
            }
        }
    }
    cout << ans;
    return 0;
}